A collection of examples where Neville elimination outperforms Gaussian elimination
نویسندگان
چکیده
Neville elimination is an elimination procedure alternative to Gaussian elimination. It is very useful when dealing with totally positive matrices, for which nice stability results are known. Here we include examples, most of them test matrices used in MATLAB which are not totally positive matrices, where Neville elimination outperforms Gaussian elimination. 2010 Elsevier Inc. All rights reserved.
منابع مشابه
A PLU-factorization of rectangular matrices by the Neville elimination
In this paper we prove that Neville elimination can be matricially described by elementary matrices. A PLU-factorization is obtained for any n×m matrix, where P is a permutation matrix, L is a lower triangular matrix (product of bidiagonal factors) and U is an upper triangular matrix. This result generalizes the Neville factorization usually applied to characterize the totally positive matrices...
متن کاملCommunication-efficient parallel generic pairwise elimination
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of generic pairwise elimination, special cases of which include Gaussian elimination with pairwise pivoting, Gaussian elimination over a finite field, generic Neville elimination and Givens reduction. We develop a new block-re...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملA Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable
A signiicant collection of two-point boundary value problems is shown to give rise to linear systems of algebraic equations on which Gaussian elimination with row partial pivoting is unstable when standard solution techniques are used.
متن کاملThe Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
Recent vector supercomputers provide vector memory access to "randomly" indexed vectors, whereas early vector supercomputers required contiguously or regularly indexed vectors. This additional capability, known as "hardware gather/scatter," can be used to great effect in general sparse Gaussian elimination. In this note we present some examples that show the impact of this change in hardware on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 216 شماره
صفحات -
تاریخ انتشار 2010